Estimating the Probability of Winning for Texas Hold’em Poker Agents

نویسنده

  • Luís Filipe Teófilo
چکیده

The development of an autonomous agent that plays Poker at human level is a very difficult task since the agent has to deal with problems like the existence of hidden information, deception and risk management. To solve these problems, Poker agents use opponent modeling to predict the opponents next move and thereby determine its next action. In this paper are described several methods to measure the risk of playing a certain hand in a given round of the game. First, we discuss the game of poker and the expectation in its events. Next, several hand evaluation and classification techniques are described and compared in order to determine the advantages of each one. The current methods to deal with risk management can help the agent’s decision. However, in future work, the integration of these methods with opponent modeling techniques should be improved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Heuristic-Based Approach for a Betting Strategy in Texas Hold'em Poker

Artificial intelligence research in Texas Hold’em poker has recently mainly focused on heads-up fixed limit game. Game theoretic methods used in the poker agents capable of playing at the very best level are not easily generalized to other forms of Texas Hold’em poker. In this paper we present a general approach to build a poker agent, where the betting strategy is defined by estimating the exp...

متن کامل

Baby Tartanian8: Winning Agent from the 2016 Annual Computer Poker Competition

Imperfect-information games, where players have private information, pose a unique challenge in artificial intelligence. In recent years, Heads-Up NoLimit Texas Hold’em poker, a popular version of poker, has emerged as the primary benchmark for evaluating game-solving algorithms for imperfectinformation games. We demonstrate a winning agent from the 2016 Annual Computer Poker Competition, Baby ...

متن کامل

Algorithms for Evolving No-Limit Texas Hold'em Poker Playing Agents

Computers have difficulty learning how to play Texas Hold’em Poker. The game contains a high degree of stochasticity, hidden information, and opponents that are deliberately trying to mis-represent their current state. Poker has a much larger game space than classic parlour games such as Chess and Backgammon. Evolutionary methods have been shown to find relatively good results in large state sp...

متن کامل

Active Sensing for Opponent Modeling in Poker

One approach to designing an intelligent agent capable of winning competitive games such as Texas hold’em poker is to use opponent modeling to learn about an opponent’s behavior, then exploit that knowledge to maximize long term winnings. However, opponent modeling can suffer from several problems, including slow convergence due to a lack of a priori knowledge, noisy or dynamic opponent behavio...

متن کامل

Evolutionary Methods for Learning No-limit Texas Hold’em Poker

No-Limit Texas Hold’em is a stochastic game of imperfect information. Cards are dealt randomly, and players try to hide which cards they are holding from their opponents. Randomness and imperfect information give Poker, in general, and No-Limit Texas Hold’em, in particular, a very large decision space when it comes to making betting decisions. Evolutionary algorithms and artificial neural netwo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011